On k-weak orders: Recognition and a tolerance result
نویسندگان
چکیده
منابع مشابه
On k-weak orders: Recognition and a tolerance result
In this paper we introduce a family of ordered sets we call k-weak orders which generalize weak orders, semi-orders, and bipartite orders. For each k, we give a polynomial-time recognition algorithm for k-weak orders and a partial characterization. In addition, we prove that among 1-weak orders, the classes of bounded bitolerance orders and totally bounded bitolerance orders are equal. This ena...
متن کاملSome result on simple hyper K-algebras
A simple method is described, to prove some theorems for simple hyper K-algebras and to study positive implicative hyper K-ideals, weak (implicative ) hyper K-ideals in simple hyper K-algebras . Beside, some results on positive implicative and (weak) implicative simple hyper K-algebras are presented. Finally classification of simple hyper Kalgebras of order 4, which are satisfied in conditions ...
متن کاملAnalysis on Children's Tolerance to Weak Recognition of Storytelling Robots
A number of studies on teaching assistant robots (or peer tutoring robots) have proven that robots can be considered effective tools for language education. Interactive storytelling, in particular, can be used for enhancing the teaching of English as a foreign language. This can be used in robot aided learning of English. However, the biggest obstacle to the interaction between human beings and...
متن کاملA consistency result on weak reflection
In this paper we study the notion of strong non-reflection, and its contrapositive weak reflection. We say θ strongly non-reflects at λ iff there is a function F : θ −→ λ such that for all α < θ with cf(α) = λ there is C club in α such that F 1 C is strictly increasing. We prove that it is consistent to have a cardinal θ such that strong non-reflection and weak reflection each hold on an unboun...
متن کاملA consistency result on weak re ectionJames
In this paper we study the notion of strong non-reeection, and its contrapositive weak reeection. We say strongly non-reeects at ii there is a function F : ! such that for all < with cf() = there is C club in such that F C is strictly increasing. We prove that it is consistent to have a cardinal such that strong non-reeection and weak reeection each hold on an unbounded set of cardinals less th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00038-1